A Tale on Guillotine Cut
نویسندگان
چکیده
The guillotine cut is an important tool to design polynomialtime approximation schemes for geometric optimization problems. In this article, we survey its history and recent developments.
منابع مشابه
Cut equivalence of d-dimensional guillotine partitions
A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) I...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملAn algorithm for the guillotine restrictions verification in a rectangular covering model
We consider the Cutting and Covering problem with guillotine restrictions. In one of our previous works, we have shown the connection between the connex components of a graph representation for the covering model and the guillotine cuts. Based on this, in this paper we propose an algorithm which can be used to verify guillotine restrictions in a two-dimensional covering model. Key–Words: bidime...
متن کاملLoading supply vessels by forward checking and a guillotine that doesn't cut
The problem of planning the layout of containers on board supply vessels can be reformulated as the problem of packing a given set of rectangles into a larger rectangle, subject to constraints. A method combining the use of guillotine cuts with forward checking is proposed, and compared to standard forward checking on finite domains. The initial results show that the method has potential for im...
متن کاملGuillotine Cut in Approximation Algorithms
The guillotine cut is one of main techniques to design polynomial-time approximation schemes for geometric optimization problems. This article is a mini survey on its history and current developments. ∗Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA. E-mail: {cheng,dzd,jkim,hngo}@cs.umn.edu.
متن کامل